package com.linwen.excise.niuke._120;

import java.util.Scanner;

/**
 * @author wlw
 * @date 2023/3/18 12:42 AM
 */
public class _108求最小公倍数 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int m = scanner.nextInt();
        int n = scanner.nextInt();
        System.out.println((m*n)/function(m,n));


    }

    private static int function(int m, int n) {
        if(m>n){
            return function(n,m);
        }
        if(n%m==0){
            return m;
        }
        int yu = n%m;
        return function(yu,m);
    }
}
